Automorphism groups of trivial extensions
نویسندگان
چکیده
منابع مشابه
Edge colored complete bipartite graphs with trivial automorphism groups
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph Ks,t which admits only the identity automorphism. In particular, we show that for a given s with a few small exceptions, there is such a coloring with c colors if and only r ≤ t ≤ cs − r where r = blogc(s − 1)c + 1 if s ≤ c or if s ≥ c + 1 and s ≥ c1+blogc(s−1)c − blogcblogc(s− 1)cc and...
متن کاملThe $w$-FF property in trivial extensions
Let $D$ be an integral domain with quotient field $K$, $E$ be a $K$-vector space, $R = D propto E$ be the trivial extension of $D$ by $E$, and $w$ be the so-called $w$-operation. In this paper, we show that $R$ is a $w$-FF ring if and only if $D$ is a $w$-FF domain; and in this case, each $w$-flat $w$-ideal of $R$ is $w$-invertible.
متن کاملMost switching classes with primitive automorphism groups contain graphs with trivial groups
The operation of switching a graph Γ with respect to a subset X of the vertex set interchanges edges and non-edges between X and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set of graphs on a given vertex set, so we can talk about the automorphism group of a switching class of graphs. It might be thought that switching classes with many automo...
متن کاملAUTOMORPHISM GROUP OF GROUPS OF ORDER pqr
H"{o}lder in 1893 characterized all groups of order $pqr$ where $p>q>r$ are prime numbers. In this paper, by using new presentations of these groups, we compute their full automorphism group.
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2002
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(01)00031-7